Rényi–Berlekamp–Ulam searching game with bi-interval queries and two lies
نویسندگان
چکیده
منابع مشابه
Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies
We consider the following searching game: there are two players, say Questioner and Responder. Responder chooses a number x ∈ Sn = {1, 2, . . . , n}, Questioner has to find out the number x by asking bi-interval queries and Responder is allowed to lie at most two times throughout the game. The minimal number q(n) of bi-interval queries sufficient to find the unknown integer x is determined for ...
متن کاملLogic and Algebra in Ulam's Searching Game with Lies
What I tell you three times is true LEWIS CARROLL Introduction In the familiar two-person game "Guess a Number", the first player chooses a number c in a certain set S, and the second player tries to find the secret number, by asking a few questions, to which the first player can only answer yes or no. Here, one might correctly object that since 1 is the only odd number in S that is also smalle...
متن کاملUlam's Searching Game with a Fixed Number of Lies
Spencer, J., Ulam’s searching game with a fixed number of lies, Theoretical Computer Science 95 (1992) 3077321. Paul tries to find an unknown x from 1 to n by asking 4 Yes-No questions. In response Carole may lie up to k times. For k fixed and n, 4 sufficiently large, necessary and sufficient conditions are given for Paul to win.
متن کاملSome Results on Searching with Lies
Two instances of the searching problem, when the answers are unreliable, are approached. If Q is the lower bound for the problem: { when using membership questions we show that (Q + 1) questions are suucient for searching an element in the set f1; : : : ; ng , for any n, when at most 3 errors are allowed. On one side it is the best known result holding for any n, on the other side the used tech...
متن کاملSearching with lies under error cost constraints
The Rényi-Berlekamp-Ulam game is a classical model for the problem of determining the minimum number of queries to find an unknown member in a finite set when up to a finite number of the answers may be erroneous. In the variant considered in this paper, questions with q many possible answers are allowed, further lies are constrained by a bipartite graph with edges weighted by 0, 1, 2, . . . (t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.12.007